Multi-target particle filtering for the probability hypothesis density
نویسنده
چکیده
When tracking a large number of targets, it is often computationally expensive to represent the full joint distribution over target states. In cases where the targets move independently, each target can instead be tracked with a separate filter. However, this leads to a model-data association problem. Another approach to solve the problem with computational complexity is to track only the first moment of the joint distribution, the probability hypothesis density (PHD). The integral of this distribution over any area S is the expected number of targets within S. Since no record of object identity is kept, the model-data association problem is avoided. The contribution of this paper is a particle filter implementation of the PHD filter mentioned above. This PHD particle filter is applied to tracking of multiple vehicles in terrain, a non-linear tracking problem. Experiments show that the filter can track a changing number of vehicles robustly, achieving near-real-time performance.
منابع مشابه
Unscented Auxiliary Particle Filter Implementation of the Cardinalized Probability Hypothesis Density Filters
The probability hypothesis density (PHD) filter suffers from lack of precise estimation of the expected number of targets. The Cardinalized PHD (CPHD) recursion, as a generalization of the PHD recursion, remedies this flaw and simultaneously propagates the intensity function and the posterior cardinality distribution. While there are a few new approaches to enhance the Sequential Monte Carlo (S...
متن کاملAuxiliary Particle Implementation of the Probability Hypothesis Density Filter
Optimal Bayesian multi-target filtering is, in general, computationally impractical due to the high dimensionality of the multi-target state. Recently Mahler, [9], introduced a filter which propagates the first moment of the multi-target posterior distribution, which he called the Probability Hypothesis Density (PHD) filter. While this reduces the dimensionality of the problem, the PHD filter s...
متن کاملComputation-distributed probability hypothesis density filter
Particle probability hypothesis density filtering has become a promising approach for multi-target tracking due to its capability of handling an unknown and time-varying number of targets in a nonlinear, non-Gaussian system. However, its computational complexity linearly increases with the number of obtained observations and the number of particles, which can be very time consuming, particularl...
متن کاملMulti-target particle filtering for the probability hypothesis density
When tracking a large number of targets, it is often computationally expensive to represent the full joint distribution over target states. In cases where the targets move independently, each target can instead be tracked with a separate filter. However, this leads to a model-data association problem. Another approach to solve the problem with computational complexity is to track only the first...
متن کاملClutter Removal in Sonar Image Target Tracking Using PHD Filter
In this paper we have presented a new procedure for sonar image target tracking using PHD filter besides K-means algorithm in high density clutter environment. We have presented K-means as data clustering technique in this paper to estimate the location of targets. Sonar images target tracking is a very good sample of high clutter environment. As can be seen, PHD filter because of its special f...
متن کامل